package DP;

/**
 * @author chenhong
 * @version 1.0.0
 * @ClassName L62.java
 * @Description TODO
 * @createTime 2022年10月08日 11:14:00
 */
public class L62 {
    public static void main(String[] args) {
        new Solution62().uniquePaths(3,7);
    }
}

class Solution62 {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        //初始化
        for (int i = 0; i < m; i++)
            dp[i][0] = 1;
        for (int i = 0; i < n; i++)
            dp[0][i] = 1;

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                System.out.println(i + "  " + j);
                dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
            }
        }
        return dp[m-1][n-1];
    }
}